Exploiting Transiently Shared Tuple Spaces for Location Transparent Code Mobility
نویسندگان
چکیده
Code mobility greatly improves the flexibility of the architecture of a distributed application. However, currently available platforms do not exploit fully the potential of mobile code. For instance, remote dynamic linking of code is often restrained to a well-known site, and applications are prevented from manipulating their own code base. In this paper, we use the notion of transiently shared tuple space, originally introduced in the Lime coordination model, to overcome these limitations. We allow tuples to contain classes, and tuple spaces become the code base associated to the loading mechanism in the mobile code runtime support. Transient sharing allows for location transparent retrieval of classes, and accommodates changes determined by the reconfiguration of the system, e.g., due to mobility. In doing this, we effectively define a new coordination approach that deals uniformly with code and data. The presentation is completed by a proof-of-concept prototype, built by extending an existing Java-based mobile code toolkit.
منابع مشابه
Data Privacy in Tuple Space Based Mobile Agent Systems
Recently, distributed variants of tuple spaces have been proposed to exploit the Linda model for programming distributed applications over wide area networks, possibly exploiting code mobility. However, the flexibility of the shared tuple space model opens possible security holes; it basically provides no access protection to the shared data. In this paper we investigate some possible scenarios...
متن کاملTransiently Shared Tuple Spaces for Sensor Networks
In this paper we argue that the notion of transiently shared tuple space, originally introduced by the Lime model and middleware to support application development in mobile ad hoc networks, can be successfully applied also to wireless sensor networks (WSNs). While the two scenarios are similar, the peculiar constraints posed by the WSNs (e.g., in terms of resources and energy) require non-triv...
متن کاملPattern Matching over a Dynamic Network of Tuple Spaces
In this paper, we present recent work carried on μK, a core calculus that retains most of the features of K: explicit process distribution, remote operations, process mobility and asynchronous communication via distributed tuple spaces. Communication in μK is based on a simple form of pattern matching that enables withdrawal from shared data spaces of matching tuples and binds the m...
متن کاملImplementing Mobile and Distributed Applications in X-Klaim
In this paper we present X-KLAIM, an experimental programming language specifically designed to program distributed systems composed of several components interacting through multiple distributed tuple spaces and mobile code. The language consists of a set of coordination primitives inspired by Linda, a set of operators for building processes borrowed from process algebras and a few classical c...
متن کاملAMRB: Toward Location and Migration Transparency of Services
In this paper, we present a new mobility-support model for applications, Application Module Request Broker (AMRB). We focus on two types of mobility: host mobility and application code mobility. These two types of mobility dynamically change the binding between applications’ name and location in the network. AMRB conceals these changes of binding to reduce a complexity in development of applica...
متن کامل